A new progressive-iterative algorithm for multiple structure alignment

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new progressive-iterative algorithm for multiple structure alignment

MOTIVATION Multiple structure alignments are becoming important tools in many aspects of structural bioinformatics. The current explosion in the number of available protein structures demands multiple structural alignment algorithms with an adequate balance of accuracy and speed, for large scale applications in structural genomics, protein structure prediction and protein classification. RESU...

متن کامل

An Efficient Progressive Alignment Algorithm for Multiple Sequence Alignment

Analyzing and comparing the string representations of sequences reveals a lot of useful information about the sequences. As new biological sequences are being generated at exponential rates, sequence comparison is becoming increasingly important to draw functional and evolutionary inference of proteins. This paper presents a partitioning approach for biomolecular sequence alignment that signifi...

متن کامل

PAAA: A Progressive Iterative Alignment Algorithm Based on Anchors

1-INTRODUCTION Multiple Sequence Alignment (MSA) is an important method to compare biological sequences. It consists in optimising the number of matches between the residues occurring in the same order in each sequence. MSA is an NP-complete problem [Wang and Jiang 94]. There are several approaches to solve this problem. Progressive approach is the most used and the most effective one, it opera...

متن کامل

An algorithm for progressive multiple alignment of sequences with insertions.

Dynamic programming algorithms guarantee to find the optimal alignment between two sequences. For more than a few sequences, exact algorithms become computationally impractical, and progressive algorithms iterating pairwise alignments are widely used. These heuristic methods have a serious drawback because pairwise algorithms do not differentiate insertions from deletions and end up penalizing ...

متن کامل

A New Dynamic Programming Algorithm for Multiple Sequence Alignment

Abstract. Multiple sequence alignment (MSA) is one of the most basic and central tasks for many studies in modern biology. In this paper, we present a new progressive alignment algorithm for this very difficult problem. Given two groups A and B of aligned sequences, this algorithm uses Dynamic Programming and the sum-of-pairs objective function to determine an optimal alignment C of A and B. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bioinformatics

سال: 2005

ISSN: 1367-4803,1460-2059

DOI: 10.1093/bioinformatics/bti527